Grashof Mechanism Synthesis Using Multi-Objective Parallel Asynchronous Particle Swarm Optimization
نویسندگان
چکیده
A distributed variant of multi-objective particle swarm optimization called multi-objective parallel asynchronous particle swarm optimization (MOPAPSO) was used to develop a new optimization-based synthesis routine for Grashof mechanisms. By using a formal multi-objective handling scheme based on Pareto dominance criteria, the need to pre-weight competing objective functions is removed and the optimal solution for a design problem can be selected from a front of candidates after the parameter optimization has been completed. Results for both four-bar and five-bar mechanism synthesis examples are shown.
منابع مشابه
A Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کاملAsynchronous Multi-Objective Optimisation in Unreliable Distributed Environments
This chapter examines the performance characteristics of both asynchronous and synchronous parallel particle swarm optimisation algorithms in heterogeneous, fault-prone environments. The chapter starts with a simple parallelisation paradigm, the Master-Slave model using Multi-Objective Particle Swarm Optimisation (MOPSO) in a heterogeneous environment. Extending the investigation to general, di...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملParallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations
1. Abstract A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high comp...
متن کامل